distribut anomali detect satellit data multipl modaliti local asynchron distribut privaci preserv featur select algorithm larg peer dto dpeer network danomica fast support vector base novelti detect techniqu local distribut peer dto dpeer algorithm multi dparti optim base privaci preserv data mine primit comput scalabl distribut chang detect astronomi data stream local electr engin surfac curvatur number area comput graphic includ mesh simplif surfac model denois featur detect photorealist line draw techniqu applic estim surfac curvatur due discret model triangular mesh recent curvatur estim limit cpu algorithm forc object geometri resid main memori comput work directli gpu increasingli common object geometri effici local algorithm distribut multivari regress peer dto dpeer network paper offer local distribut algorithm multivari regress larg peer peer environ algorithm design distribut inferenc data compact data model classif task emerg peer peer applic bioinformat astronomi social network sensor network web mine comput global regress model data peer node tradit central algorithm regress costli impract larg number data sourc asynchron natur peer peer network dynam natur data network paper propos step approach deal problem offer effici local distribut algorithm monitor qualiti current regress model model outdat algorithm feedback mechan rebuild model local natur monitor algorithm guarante low monitor cost experiment result present paper strongli support theoret claim distribut identif top dl product element applic peer dto dpeer network abstract product measur close featur vector relat import primit popular data mine task cluster classif correl comput decis tree construct entir data set singl site comput product matrix identifi top term magnitud entri trivial real world scenario data distribut locat transmit data central server commun intens scalabl paper present approxim local algorithm identifi top product pair featur vector larg asynchron distribut environ peer peer network develop probabilist algorithm purpos order statist hoeffd bound present experiment result show effect scalabl algorithm final demonstr applic techniqu interest base commun format environ index term distribut data mine product peer topeer network distribut decis dtree induct peer dto dpeer system paper offer scalabl robust distribut algorithm decis tree induct larg peer peer environ comput decis tree larg distribut system standard central algorithm commun expens impract synchron requir problem challeng distribut stream monitor scenario decis tree updat respons data distribut paper present altern solut work complet asynchron manner distribut environ offer low commun overhead necess scalabl seamlessli handl data peer failur paper present extens experiment result corrobor theoret claim index term peer peer data mine decis tree peer dto dpeer data mine privaci issu game local dthreshold base data mine peer dto dpeer system larg network comput wireless sensor mobil devic compon peer data global statu system function system rout decis search strategi data cleans assign mutual trust depend global statu essenti system detect react global statu comput global predic system costli scale case sensor network high cost commun cost increas data rapidli due state node failur comput follow paper describ step approach deal cost describ highli effici local algorithm detect norm averag data surpass threshold algorithm feedback loop monitor complex predic data data mean cluster effici algorithm guarante long cluster result repres data data stationari resourc requir data undergo epoch chang chang underli distribut model longer repres feedback loop model rebuilt exist feedback loop approxim effort method construct model ill fit model built feedback loop model rebuilt distribut data mine peer dto dpeer network distribut data mine deal problem data analysi environ distribut data comput node user peer peer comput emerg distribut comput paradigm applic involv exchang inform larg number peer central coordin file share electron commerc monitor base network sensor exampl paper offer overview distribut data mine applic algorithm environ describ exact approxim distribut data mine algorithm work decentr manner client dside web mine commun format peer dto dpeer environ paper present framework format interest base peer peer commun client side web brows histori propos order statist base algorithm build commun hierarch structur carefulli privaci concern peer adopt cryptograph protocol measur similar peer disclos person profil evalu algorithm distribut data mine toolkit experiment result show framework effici build interest base commun 